Maintaining Consistency of Probabilistic Databases A Linear Programming Approach.

Discovering significant relaxed order%2Dpreserving submatrices.

Efficient processing of group%2Doriented connection queries in a large graph.

MRM an adaptive framework for XML searching.

MRM an adaptive framework for XML searching.

Context%2DAware Object Connection Discovery in Large Graphs.

Context%2DAware Object Connection Discovery in Large Graphs.

Maintaining consistency of vague databases using data dependencies.

Developing Preference Band Model to Manage Collective Preferences.

Discovering bucket orders from full rankings.

Correlated pattern mining in quantitative databases.

Effective elimination of redundant association rules.

Personalized Concept%2DBased Clustering of Search Engine Queries.
Abstract—A major problem of current Web search is that search queries are usually short and ambiguous, and thus are insufficient for specifying the precise user needs. To alleviate this problem, some search engines suggest terms that are semantically related to the submitted queries so that users can choose from the suggestions the ones that reflect their information needs. In this paper, we introduce an effective approach that captures the user’s conceptual preferences in order to provide personalized query suggestions. We achieve this goal with two new strategies. First, we develop online techniques that extract concepts from the web-snippets of the search result returned from a query and use the concepts to identify related queries for that query. Second, we propose a new twophase personalized agglomerative clustering algorithm that is able to generate personalized query clusters. To the best of the authors’ knowledge, no previous work has addressed personalization for query suggestions. To evaluate the effectiveness of our technique, a Google middleware was developed for collecting clickthrough data to conduct experimental evaluation. Experimental results show that our approach has better precision and recall than the existing query clustering methods. Index Terms—Clickthrough, concept-based clustering, personalization, query clustering, search engine. Ç 1
Efficient Correlation Search from Graph Databases.

Efficient Correlation Search from Graph Databases.

A survey on algorithms for mining frequent itemsets over data streams.
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of frequent itemsets (FIs). Unlike mining static databases, mining data streams poses many new challenges. In addition to the one-scan nature, the unbounded memory requirement and the high data arrival rate of data streams, the combinatorial explosion of itemsets exacerbates the mining task. The high complexity of the FI mining problem hinders the application of the stream mining techniques. We recognize that a critical review of existing techniques is needed in order to design and develop efficient mining algorithms and data structures that are able to match the processing rate of the mining with the high arrival rate of data streams. Within a unifying set of notations and terminologies, we describe in this paper the efforts and main techniques for mining data streams and present a compre-hensive survey of a number of the state-of-the-art algorithms on mining frequent itemsets over data streams. We classify the stream-mining techniques into two categories based on the window model that they adopt in order to provide in-sights into how and why the techniques are useful. Then, we further analyze the algorithms according to whether they are exact or approximate and, for approxi-mate approaches, whether they are false-positive or false-negative. We also discuss various interesting issues, including the merits and limitations in existing research and substantive areas for future research. 1 1
An information%2Dtheoretic approach to quantitative association rule mining.
Abstract. Quantitative Association Rule (QAR) mining has been rec-ognized an influential research problem over the last decade due to the popularity of quantitative databases and the usefulness of associ-ation rules in real life. Unlike Boolean Association Rules (BARs), which only consider boolean attributes, QARs consist of quantitative attributes which contain much richer information than the boolean attributes. How-ever, the combination of these quantitative attributes and their value in-tervals always gives rise to the generation of an explosively large number of itemsets, thereby severely degrading the mining efficiency. In this paper, we propose an information-theoretic approach to avoid un-rewarding combinations of both the attributes and their value intervals being generated in the mining process. We study the mutual information between the attributes in a quantitative database and devise a normal-ization on the mutual information to make it applicable in the context of QAR mining. To indicate the strong informative relationships among the
A multi%2Dranker model for adaptive XML searching.

Divide
The APU Floating-Point Unit comprises execution units, a register file, bus interface and all the control logic necessary to manage the execution of floating-point instructions. Figure 1 provides an overview of the Floating-Point Unit (FPU) architecture.
Towards Adaptive Information Merging Using Selected XML Fragments.

An Efficient Index Lattice for XML Query Evaluation.

A Development of Hash%2DLookup Trees to Support Querying Streaming XML.

Mining Vague Association Rules.
Abstract. In many online shopping applications, traditional Association Rule (AR) mining has limitations as it only deals with the items that are sold but ignores the items that are almost sold. For example, those items that are put into the basket but not checked out. We say that those almost sold items carry hesitation information since customers are hesitating to buy them. The hesitation information of items is valuable knowledge for the design of good selling strategies. We apply vague set theory in the context of AR mining as to incorporate the hesitation information into the ARs. We define the concepts of attractiveness and hesitation of an item, which represent the overall information of a customer’s intent on an item. Based on these two concepts, we propose the notion of Vague Association Rules (VARs) and devise an efficient algorithm to mine the VARs. Our experiments show that our algorithm is efficient and the VARs capture more specific and richer information than traditional ARs. 1
Handling Inconsistency of Vague Relations with Functional Dependencies.
Abstract. Vague information is common in many database applications due to internet-scale data dissemination, such as those data arising from sensor networks and mobile communications. We have formalized the notion of a vague relation in order to model vague data in our previous work. In this paper, we utilize Functional Dependencies (FDs), which are the most fundamental integrity constraints that arise in practice in relational databases, to maintain the consistency of a vague relation. The problem we tackle is, given a vague relation r over a schema R and a set of FDs F over R, what is the “best ” approximation of r with respect to F when taking into account of the median membership (m) and the imprecision membership (i) thresholds. Using these two thresholds of a vague set, we define the notion of mi-overlap between vague sets and a merge operation on r. Satisfaction of an FD in r is defined in terms of values being mi-overlapping. We show that Lien’s and Atzeni’s axiom system is sound and complete for FDs being satisfied in vague relations. We study the chase procedure for a vague relation r over R, named VChase(r, F), as a means to maintain consistency of r with respect to F. Our main result is that the output of the procedure is the most object-precise approximation of r with respect to F. The complexity of VChase(r, F) is polynomial time in the sizes of r and F. 1
Prioritized Preferences and Choice Constraints.

Mining Hesitation Information by Vague Association Rules.
Abstract. In many online shopping applications, such as Amazon and eBay, traditional Association Rule (AR) mining has limitations as it only deals with the items that are sold but ignores the items that are almost sold (for example, those items that are put into the basket but not checked out). We say that those almost sold items carry hesitation information, since customers are hesitating to buy them. The hesitation information of items is valuable knowledge for the design of good selling strategies. However, there is no conceptual model that is able to capture different statuses of hesitation information. Herein, we apply and extend vague set theory in the context of AR mining. We define the concepts of attractiveness and hesitation of an item, which represent the overall information of a customer’s intent on an item. Based on the two concepts, we propose the notion of Vague Association Rules (VARs). We devise an efficient algorithm to mine the VARs. Our experiments show that our algorithm is efficient and the VARs capture more specific and richer information than do the traditional ARs. 1
Correlation search in graph databases.
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation mining from graph databases is still lacking despite the fact that graph data, especially in various scientific domains, proliferate in recent years. In this paper, we propose a new problem of correlation mining from graph databases, called Correlated Graph Search (CGS). CGS adopts Pearson’s correlation coefficient as a correlation measure to take into consideration the occurrence distributions of graphs. However, the problem poses significant challenges, since every subgraph of a graph in the database is a candidate but the number of subgraphs is exponential. We derive two necessary conditions which set bounds on the occurrence probability of a candidate in the database. With this result, we design an efficient algorithm that operates on a much smaller projected database and thus we are able to obtain a significantly smaller set of candidates. To further improve the efficiency, we develop three heuristic rules and apply them on the candidate set to further reduce the search space. Our extensive experiments demonstrate the effectiveness of our method on candidate reduction. The results also justify the efficiency of our algorithm in mining correlations from large real and synthetic datasets.
MQX multi%2Dquery engine for compressed XML data.

Fg%2Dindex towards verification%2Dfree query processing on graph databases.

Mining User preference using Spy voting for search engine personalization.
This paper addresses search engine personalization. We present a new approach to mining a user’s preferences on the search results from clickthrough data and using the discovered preferences to adapt the search engine’s ranking function for improving search quality. We develop a new preference mining technique called SpyNB, which is based on the practical assumption that the search results clicked on by the user reflect the user’s preferences, but it does not draw any conclusions about the results that the user did not click on. As such, SpyNB is still valid even if the user does not follow any order in reading the search results or does not click on all relevant results. Our extensive offline experiments demonstrate that SpyNB discovers many more accurate preferences than existing algorithms do. The interactive online experiments further confirm that SpyNB and our personalization approach are effective in practice. We also show that the efficiency of SpyNB is comparable to existing simple preference mining algorithms.

Mark Levene


Positioning%2DBased Query Translation Between SQL and XQL with Location Counter.

An Efficient Approach to Support Querying Secure Outsourced XML Information.
Abstract. Data security is well-recognized a vital issue in an information system that is supported in an outsource environment. However, most of conventional XML encryption proposals treat confidential parts of an XML document as whole blocks of text and apply encryption algorithms directly on them. As a result, queries involving the encrypted part cannot be efficiently processed. In order to address these problems, we propose XQEnc, a novel approach to support querying encrypted XML. XQEnc is based on two important techniques of vectorization and skeleton compression. Essentially, vectorization, which is a generalization of columns of a relational table, makes use the basic path of an XML tree to label the data values. Skeleton compression collapses the redundant paths into a multiplicity attribute. Our analysis and experimental study shows that XQEnc achieves both better query efficiency and more robust security compared with conventional methods. As an application, we show how XQEnc can be realized with relational techniques to enable secure XML data outsourcing. 1
An Efficient Co%2Doperative Framework for Multi%2Dquery Processing over Compressed XML Data.
Abstract. XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due to the repeated tags and structures. The data verbosity problem gives rise to many challenges of conventional distributed database technologies. In this paper, we study the XML dissemination problem over the Internet, where the speed of information delivery can be rather slow in a server-client architecture which consists of a large number of geographically spanned users who access a large amount of correlated XML information. The problem becomes more severe when the users access closely related XML fragments, and in this case the usage of bandwidth is inefficient. In order to save bandwidth and process the queries efficiently, we propose an architecture that incorporates XML compression techniques and exploits the results of XPath containment. Within our framework, we demonstrate that the loading of the server is reduced, the network bandwidth can be more efficiently used and, consequently, all clients as a whole can benefit due to savings of various costs. 1
Preference Functional Dependencies for Managing Choices.
Abstract. The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures the human wishes on querying and managing data. The paradigm of preference-driven choices in the real world requires new semantic constraints in modelling. In this paper, we assume preference constraints can be defined over data domains and thus the assumption gives rise to preference relations as a special case of ordered relations over schemas consisting of the preference, preferencedependent and preference-independent attributes. We demonstrate that Lexicographically Ordered Functional Dependencies (LOFDs) can be employed to maintain the consistency of preference semantics embedded in preference database, since prioritized multiple preferences can be represented. We thus define a useful semantic constraint in terms of a set of LOFDs, called Preference Functional Dependencies (PFDs), in order to capture the semantics of the preference ranked data. We exhibit a sound and complete axiom system for PFDs, whose implication problem is shown to be decidable in polynomial-time. We also confirm the existence of Armstrong preference relations for PFDs, a fundamental result related to the practical use of PFDs in database design. 1
MIC Framework An Information%2DTheoretic Approach to Quantitative Association Rule Mining.

delta%2DTolerance Closed Frequent Itemsets.

Mining quantitative correlated patterns using an information%2Dtheoretic approach.
Existing research on mining quantitative databases mainly focuses on mining associations. However, mining associations is too expensive to be practical in many cases. In this paper, we study mining correlations from quantitative databases and show that it is a more effective approach than mining associations. We propose a new notion of Quantitative Correlated Patterns (QCPs), which is founded on two formal concepts, mutual information and all-confidence. We first devise a normalization on mutual information and apply it to QCP mining to capture the dependency between the attributes. We further adopt all-confidence as a quality measure to control, at a finer granularity, the dependency between the attributes with specific quantitative intervals. We also propose a supervised method to combine the consecutive intervals of the quantitative attributes based on mutual information, such that the interval combining is guided by the dependency between the attributes. We develop an algorithm, QCoMine, to efficiently mine QCPs by utilizing normalized mutual information and all-confidence to perform a two-level pruning. Our experiments verify the efficiency of QCoMine and the quality of the QCPs.
Maintaining Frequent Itemsets over High%2DSpeed Data Streams.
Abstract. We propose a false-negative approach to approximate the set of frequent itemsets (FIs) over a sliding window. Existing approximate algorithms use an error parameter, ǫ, to control the accuracy of the mining result. However, the use of ǫ leads to a dilemma. A smaller ǫ gives a more accurate mining result but higher computational complexity, while increasing ǫ degrades the mining accuracy. We address this dilemma by introducing a progressively increasing minimum support function. When an itemset is retained in the window longer, we require its minimum support to approach the minimum support of an FI. Thus, the number of potential FIs to be maintained is greatly reduced. Our experiments show that our algorithm not only attains highly accurate mining results, but also runs significantly faster and consumes less memory than do existing algorithms for mining FIs over a sliding window. 1
Web dynamics and their ramifications for the development of Web search engines.
The World Wide Web has become the largest hypertext system in existence, providing an extremely rich collection of information resources. Compared with conventional information sources, the Web is highly dynamic in the following four factors: size (i.e., the growing number of Web sites and pages), Web pages (page content and page existence), hyperlink structures and users ’ searching needs. As the most popular and important tools for finding information on the Web, Web search engines have to face many challenges arising from the Web dynamics. This paper surveys the research issues on Web dynamics and discusses how search engines address the four factors of Web dynamics. We then briefly discuss the main issues and directions of future development of Web search engines. 1
XCQ A queriable XML compression system.

Comparative Analysis of XML Compression Technologies.

Effective Approaches for Watermarking XML Data.
Abstract. Watermarking enables provable rights over content, which has been successfully applied in multimedia applications. However, it is not trivial to apply the known effective watermarking schemes to XML data, since noisy data may not be acceptable due to its structures and node extents. In this paper, we present two different watermarking schemes on XML data: the selective approach and the compression approach. The former allows us to embed non-destructive hidden information content over XML data. The latter takes verbosity and the need in updating XML data in real life into account. We conduct experiments on the efficiency and robustness of both approaches against different forms of attack, which shows that our proposed watermarking schemes are reasonably efficient and effective. 1
A Unifying Framework for Merging and Evaluating XML Information.

Vague Sets or Intuitionistic Fuzzy Sets for Handling Vague Data Which One Is Better%3F
Abstract. In the real world there are vaguely specified data values in many applications, such as sensor information. Fuzzy set theory has been proposed to handle such vagueness by generalizing the notion of membership in a set. Essentially, in a Fuzzy Set (FS) each element is associated with a point-value selected from the unit interval [0,1], which is termed the grade of membership in the set. A Vague Set (VS), as well as an Intuitionistic Fuzzy Set (IFS), is a further generalization of an FS. Instead of using point-based membership as in FSs, interval-based membership is used in a VS. The interval-based membership in VSs is more expressive in capturing vagueness of data. In the literature, the notions of IFSs and VSs are regarded as equivalent, in the sense that an IFS is isomorphic to a VS. Furthermore, due to such equivalence and IFSs being earlier known as a tradition, the interesting features for handling vague data that are unique to VSs are largely ignored. In this paper, we attempt to make a comparison between VSs and IFSs from various perspectives of algebraic properties, graphical representations and practical applications. We find that there are many interesting differences from a data modelling point of view. Incorporating the notion of VSs in relations, we describe Vague SQL (VSQL), which is an extension of SQL for the vague relational model, and show that VSQL combines the capabilities of a standard SQL with the power of manipulating vague relations. Although VSQL is a minimal extension to illustrate its usages, VSQL allows users to formulate a wide range of queries that occur in different modes of interaction between vague data and queries. 1
Applying Co%2Dtraining to Clickthrough Data for Search Engine Adaptation.
The information on the World Wide Web is growing without  bound. Users may have very diversified preferences in the pages they target  through a search engine. It is therefore a challenging task to adapt a search  engine to suit the needs of a particular community of users who share similar  interests. In this paper, we propose a new algorithm, Ranking SVM in a  Co-training Framework (RSCF). Essentially, the RSCF algorithm takes the  clickthrough data containing the items in the search result that have been  clicked on by a user as an input, and generates adaptive rankers as an output.
Applying Co%2Dtraining to Clickthrough Data for Search Engine Adaptation.
The information on the World Wide Web is growing without  bound. Users may have very diversified preferences in the pages they target  through a search engine. It is therefore a challenging task to adapt a search  engine to suit the needs of a particular community of users who share similar  interests. In this paper, we propose a new algorithm, Ranking SVM in a  Co-training Framework (RSCF). Essentially, the RSCF algorithm takes the  clickthrough data containing the items in the search result that have been  clicked on by a user as an input, and generates adaptive rankers as an output.
XQzip Querying Compressed XML Using Structural Indexing.
Abstract. XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many effective XML compressors, such as XMill, have been recently proposed to solve this data inflation problem, they do not address the problem of running queries on compressed XML data. More recently, some compressors have been proposed to query compressed XML data. However, the compression ratio of these compressors is usually worse than that of XMill and that of the generic compressor gzip, while their query performance and the expressive power of the query language they support are inadequate. In this paper, we propose XQzip, an XML compressor which supports querying compressed XML data by imposing an indexing structure, which we call Structure Index Tree (SIT), on XML data. XQzip addresses both the compression and query performance problems of existing XML compressors. We evaluate XQzip’s performance extensively on a wide spectrum of benchmark XML data sources. On average, XQzip is able to achieve a compression ratio 16.7 % better and a querying time 12.84 times less than another known queriable XML compressor. In addition, XQzip supports a wide scope of XPath queries such as multiple, deeply nested predicates and aggregation. 1
Managing Merged Data by Vague Functional Dependencies.
Abstract. In this paper, we propose a new similarity measure between vague sets and apply vague logic in a relational database environment with the objective of capturing the vagueness of the data. By introducing a new vague Similar Equality (SEQ) for comparing data values, we first generalize the classical Functional Dependencies (FDs) into Vague Functional Dependencies (VFDs). We then present a set of sound and complete inference rules. Finally, we study the validation process of VFDs by examining the satisfaction degree of VFDs, and the merge-union and merge-intersection on vague relations. 1
WUML A Web Usage Manipulation Language for Querying Web Log Data.
Abstract. In this paper, we develop a novel Web Usage Manipulation Language (WUML) which is a declarative language for manipulating Web log data. We assume that a set of trails formed by users during the navigation process can be identified from Web log files. The trails are dually modelled as a transition graph and a navigation matrix with respect to the underlying Web topology. A WUML expression is executed by transforming it into Navigation Log Algebra (NLA), which consists of the sum, union, difference, intersection, projection, selection, power and grouping operators. As real navigation matrices are sparse, we perform a range of experiments to study the impact of using different matrix storage schemes on the performance of the NLA. 1
Spying Out Accurate User Preferences for Search Engine Adaptation.
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickthrough data to adapt a search engine’s ranking function. Clickthrough data indicate for each query the results that are clicked by users. As a kind of implicit relevance feedback information, clickthrough data can easily be collected by a search engine. However, clickthrough data is sparse and incomplete, thus, it is a challenge to discover accurate user preferences from it. In this paper, we propose a novel algorithm called “Spy Naïve Bayes ” (SpyNB) to identify user preferences generated from clickthrough data. First, we treat the result items clicked by the users as sure positive examples and those not clicked by the users as unlabelled data. Then, we plant the sure positive examples (the spies) into the unlabelled set of result items and apply a naïve Bayes classification to generate the reliable negative examples. These positive and negative examples allow us to discover more accurate user’s preferences. Finally, we employ the SpyNB algorithm with a ranking SVM optimizer to build an adaptive metasearch engine. Our experimental results show that, compared with the original ranking, SpyNB can significantly improve the average ranks of users ’ click by 20%. 1
Storing and Querying XML Data in the Nested Relational Sequence Database System.

Repairing Inconsistent Merged XML Data.

Querying XML Data by the Nested Relational Sequence Database System.

Refining Web Authoritative Resource by Frequent Structures.

Managing XML by the Nested Relational Sequence Database System.

Using Index to Manage the Ordering Structure of XML Data in the Nested Relational Sequence Database System.

XCQ XML Compression and Querying System.

Adapting Web Interfaces by WHAT.

The Development of Ordered SQL Packages in Peer%2Dto%2DPeer Warehousing Environment.

Adapting Web Interfaces by WHAT.

Towards the Conceptual Tree Model for Web Reorganization.

Towards a Web Interaction Model for Web Usage Studies.

Maintaining Consistency of Integrated XML Trees.

Maintaining Consistency of Integrated XML Trees.

Capturing the Semantics of Weg Log Data by Navigation Matrices.

Implementing WHAT to Support Web Usage Management.

An extension of the relational data model to incorporate ordered domains.
We extend the relational data model to incorporate partial orderings into data domains, which we call the ordered relational model. Within the extended model, we define the Partially Ordered Relational Algebra (the PORA) by allowing the ordering predicate ⊑ to be used in formulae of the selection operator (σ). The PORA expresses exactly the set of all possible relations which are invariant under order-preserving automorphism of databases. This result characterises the expressiveness of the PORA and justifies the development of Ordered SQL (OSQL) as a query language for ordered databases. OSQL provides users with the capability of capturing the semantics of ordered data in many advanced applications, such as those having temporal or incomplete information. Ordered Functional Dependencies (OFDs) on ordered databases are studied, based on two possible extensions of domain orderings: (1) pointwise-ordering and (2) lexicographical ordering. We present a sound and complete axiom system for OFDs in the first case and establish a set of sound and complete chase rules for OFDs in the second. Our results suggest that the implication problems for both cases of OFDs are decidable and that the enforcement of OFDs in ordered relations are practically feasible. In a wider perspective, the proposed model explores an important area of object-relational databases, since ordered domains can be viewed as a general kind of data type. Categories and Subject Descriptors: H.2.1 [Database Management]: Logical Design—data
The Development of Ordered SQL Packages to Support Data Warehousing.
Data warehousing is a corporate strategy that needs to integrate information from several sources of separately developed Database Management Systems (DBMSs). A future DBMS of a data warehouse should provide adequate facilities to manage a wide range of information arising from such integration. We propose that the capabilities of database languages should be enhanced to manipulate user-defined data orderings, since business queries in an enterprise usually involve order. We extend the relational model to incorporate partial orderings into data domains and describe the ordered relational model. We have already defined and implemented a minimal extension of SQL, called OSQL, which allows querying over ordered relational databases. One of the important facilities provided by OSQL is that it allows users to capture the underlying semantics of the ordering of the data for a given application. Herein we demonstrate that OSQL aided with a package discipline can be an effective means to manage the interrelated operations and the underlying data domains of a wide range of advanced applications that are vital in data warehousing, such as temporal, incomplete and fuzzy information. We present the details of the generic operations arising from these applications in the form of three OSQL packages called: OSQL_TIME, OSQL_INCOMP and OSQL_FUZZY. Data warehousing is a corporate strategy that addresses a broad range of decision support requirements such as
Using an Ordered Key Attribute in Database Design.

Querying Databases with Knowledge Domains.

Extending Functional Dependencies in Indefinite Sequence Relations.

Ordered Functional Dependencies in Relational Databases.
Abstract | We extend the relational data model to incorporate linear orderings into data domains, which we call the ordered relational model. The conventional Functional Dependencies (FDs) are examined in the context of ordered relational databases by using the notion of System Ordering Independence (SOI), which refers to the desirable scenario that the ordering of tuples in a relation is independent of the implementation of the underlying DBMS. We also extend Armstrong&#039;s axiom system for FDs to object relations, which are a subclass of ordered relations that allow us to view tuples as objects. We formally de ne Ordered Functional Dependencies (OFDs) for the extended model by means of two possible extensions of domains, pointwise-orderings and lexicographical orderings. We rst present a sound and complete axiom system for OFDs in the case of pointwise-orderings and then establish a sound and complete set of chase rules for OFDs in the case of lexicographical orderings. Our main result shows that the implication problems for both cases of OFDs are decidable, and that
Lexicographically Ordered Functional Dependencies and Their Application to Temporal Relations.

Ordered Functional Dependencies in Relational Databases.
Abstract | We extend the relational data model to incorporate linear orderings into data domains, which we call the ordered relational model. The conventional Functional Dependencies (FDs) are examined in the context of ordered relational databases by using the notion of System Ordering Independence (SOI), which refers to the desirable scenario that the ordering of tuples in a relation is independent of the implementation of the underlying DBMS. We also extend Armstrong&#039;s axiom system for FDs to object relations, which are a subclass of ordered relations that allow us to view tuples as objects. We formally de ne Ordered Functional Dependencies (OFDs) for the extended model by means of two possible extensions of domains, pointwise-orderings and lexicographical orderings. We rst present a sound and complete axiom system for OFDs in the case of pointwise-orderings and then establish a sound and complete set of chase rules for OFDs in the case of lexicographical orderings. Our main result shows that the implication problems for both cases of OFDs are decidable, and that
Inferring Functional Dependencies in Linerly Ordered Databases.

Inferring Functional Dependencies in Linerly Ordered Databases.


The Development of Ordered SQL Packages for Modelling Advanced Applications.


OSQL An Extension to SQL to Manipulate Ordered Relational Databases.

